Approximation to the M/D/s queue with finite buffer: Application to the CLR in ATM nodes
نویسندگان
چکیده
This paper deals with an approximation for the fraction of lost units in the slotted-output M/D/s/s+B queue with finite buffer of capacity B. To this end, the concept of equivalent load is re-introduced to easily estimate the fraction of lost units. The proposed estimation is tested in a ATM environment where the M/D/s/s+B queue is applied to give a first approach to the Cell-Loss-Rate (CLR) in ATM switches with output buffers. The estimation is transform-free and very simple to compute, and proves to give accurate results within the range of values of interest in ATM switches: medium and high load and not very large number of servers.
منابع مشابه
M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملDesign of new real-time models for tight upper bound approximation of cell loss ratio in ATM networks
ATM as a high-speed cell switching technology can support multiple classes of traffic with different quality of service (QoS) requirements and diverse traffic characteristics. A main QoS requirement is the cell loss ratio (CLR). We need a real-time expression for the CLR calculation in ATM networks where the statistical multiplexing is an important factor. The existing analytical methods for th...
متن کاملQueue with Heterogeneous Server Under Resequencing Constraint
In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.?
متن کامل